package dp.basics;
//746. 使用最小花费爬楼梯
public class Num746_minCostClimbingStairs {
    public int minCostClimbingStairs(int[] cost) {
        int n = cost.length;
        int []dp = new  int[n + 1];//表示到达第i个台阶的最低消费
        dp[0] = 0;//到第一个台阶的钱
        dp[1] = 0;//到第二个台阶的钱
        for (int i = 2; i <= n; i++) {
            dp[i] = Math.min(dp[i - 1] + cost[i - 1] , dp[i - 2] + cost[i - 2]);
        }
        return dp[n];


    }
}
